Reducing location update and paging costs in a PCS network

نویسندگان

  • Pablo García-Escalle
  • Vicente Casares Giner
  • Jorge Mataix Oltra
چکیده

Mobility Tracking operations in a personal communication service (PCS) system are signaling consuming. Several strategies have been proposed in the literature to reduce both, the location update (LU) and the paging (PG) costs. In this paper, we propose a location-tracking algorithm called three-location area (TrLA), combined with selective paging. In the TrLA, the mobile terminal (MT) allocates the identification of three neighboring location areas (LAs) in its local memory. We call this set of three LAs, a big-location area (BLA). Each time the MT exits the BLA, it triggers an LU message to the system Databases via a base station, in order to maintain the Databases up to date. The MT also updates its caché memory. A two-step selective PG is also considered and compared with the single-step (or nonselective PG). An analytical model based on a semi-Markov process has been used to evaluate our proposal. This scheme is compared with the classical Global System for Mobile Communications (GSM) standard and the Two-Location Algorithm proposal. As a result, this new scheme outperforms the cited strategies, and in our opinion, it can easily be implemented in existing standard cellular and personal communication systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Location Management Cost Strategies in Cellular Networks

The growth of cellular users using to communicate at any place and any time increases the signaling activities among the cellular networks. To reduce the network costs and better usage of radio resources, an efficient location management scheme: location updating and paging strategies are essential to improve the network performance. This paper presents a mixed location management strategy that...

متن کامل

Reducing the Paging Costs under Delay Bound for PCS Networks

In this paper new paging schemes are introduced to reduce paging costs under delay bounds. In general , location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. Three new paging schemes, reverse, semi-reverse and uniform, provide a simple way of partitioning the service areas and accordingly minimize the paging costs based on each mobile t...

متن کامل

Reducing the paging costs under delay bounds for PCS networks

In this paper new paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since the paging cost is associated with bandwidth utilization and delay bounds influence call setup time. In general, location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. To reduce the paging cost...

متن کامل

Location Management Cost for Dynamic Location Update and Paging for Pcs Networks

The standard technique for cellular networks is to decrease radio cell size, thereby maintaining a supportable subscriber density. However, smaller cell sizes result in increased signaling for location management procedures, which reduces the bandwidth available for user traffic and increases the cost. A dynamic distance-based location update with sequential paging with no delay constraint algo...

متن کامل

An Adaptive Direction-Based Location Update Scheme for Next Generation PCS Networks

1 The work described in this paper was partially supported by a strategic grant from the City University of Hong Kong [Project No. CityU 7001259]. Abstract. This paper studies the location management problem in PCS network. An adaptive direction-based location update (ADBU) scheme is proposed in which a line-paging method is adopted to minimize the paging cost and an adaptive direction-based sc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Wireless Communications

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2002